منابع مشابه
Implementation of Game Tree Search Method by using NSL
This paper describes about hardware game tree search method of Blokus Duo. As algorithm of the game tree search method, we apply an evaluation function of sphere of influence. The game tree search method of hardware is implemented on FPGA. An implementation of the game tree search method by the hardware shows the effect which is easily of the operating speed improving.
متن کاملGame-tree Search Algorithm based on Realization Probability
In games like chess, the node-expansion strategy significantly affects the performance of a gameplaying program. In this article we propose a new game-tree search algorithm that uses the realization probabilities of nodes for deciding upon the range of the search. The realization probability of a node represents the probability that the moves leading to the node will actually be played. Our alg...
متن کاملProbability-Based Game Tree Pruning
In game-tree search, a point value is customarily used to measure position evaluation. If the uncertainty about the value is to be reflected in the evaluation, which is described with probabilistic distribution or probabilities, the search process must back up distributions from leaf nodes to the root. It is shown that even though the merit value of a node is described by probabilities, α-β bou...
متن کاملAdversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of opponents, we can model both collaborative problem solving, where intelligent participants with different agendas must work together to solve a problem, and multi-criteria optimisation, where one decision maker must balance...
متن کاملAPHID Game-Tree Search
This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is controlled by a master and a series of slave processors. The master searches the rst d 0 ply of the game-tree repeatedly. The slaves are responsible for the bottom plies of the game-tree. The slaves asynchronously read work lists from the master and return scor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2002
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.2002.51